Image retrieval using Nash equilibrium and Kalai-Smorodinsky solution

In this paper, we propose a new formulation of Nash games for solving general multi-objectives optimization problems. The objective approach is to split the variables, allowing us determine numerically strategies between two players. first player minimizes his function cost using variables table P and second player, Q. original contribution work concerns construction tables allocations that lead equilibrium on Pareto front. proposition paper find Equilibrium solution, which coincides with Kalai--Smorodinsky solution. Two algorithms calculate P, Q their associated equilibrium, by some extension normal boundary intersection approach, are tried out successfully. Then, search engine look similar images given image based multiple representations Color, Texture Shape Features.